Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(x,y,z) |
→ g(x,y,z) |
| 2: |
|
g(0,1,x) |
→ f(x,x,x) |
| 3: |
|
a |
→ b |
| 4: |
|
a |
→ c |
|
There are 2 dependency pairs:
|
| 5: |
|
F(x,y,z) |
→ G(x,y,z) |
| 6: |
|
G(0,1,x) |
→ F(x,x,x) |
|
The approximated dependency graph contains one SCC:
{5,6}.
-
Consider the SCC {5,6}.
There are no usable rules.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 3, 2006